Search results for " routing"
showing 10 items of 229 documents
Routing electric vehicles with a single recharge per route
2020
Networks : an international journal (2020). doi:10.1002/net.21964
Synchronization in Vehicle Routing—A Survey of VRPs with Multiple Synchronization Constraints
2012
This paper presents a survey of vehicle routing problems with multiple synchronization constraints. These problems exhibit, in addition to the usual task covering constraints, further synchronization requirements between the vehicles, concerning spatial, temporal, and load aspects. They constitute an emerging field in vehicle routing research and are becoming a “hot” topic. The contribution of the paper is threefold: (i) It presents a classification of different types of synchronization. (ii) It discusses the central issues related to the exact and heuristic solution of such problems. (iii) It comprehensively reviews pertinent literature with respect to applications as well as successful s…
The computational complexity of the relative robust shortest path problem with interval data
2004
Abstract The paper deals with the relative robust shortest path problem in a directed arc weighted graph, where arc lengths are specified as intervals containing possible realizations of arc lengths. The complexity status of this problem has been unknown in the literature. We show that the problem is NP -hard.
Dynamic routing-and-inventory problems: a review
1998
The paper presents a review of the available literature on a class of problems denoted as dynamic routing-and-inventory (DRAI) problems. They are characterized by the simultaneous relevance of routing and of inventory issues in a dynamic environment, within the framework of distribution logistics. A classification scheme is first proposed for these problems. Then the results obtained in this area are summarized. Finally, the papers available in the literature are clustered and discussed according to the proposed scheme.
Addressing Manufacturing Challenges with Cost-Efficient Fault Tolerant Routing
2010
The high-performance computing domain is enriching with the inclusion of Networks-on-chip (NoCs) as a key component of many-core (CMPs or MPSoCs) architectures. NoCs face the communication scalability challenge while meeting tight power, area and latency constraints. Designers must address new challenges that were not present before. Defective components, the enhancement of application-level parallelism or power-aware techniques may break topology regularity, thus, efficient routing becomes a challenge.In this paper, uLBDR (Universal Logic-Based Distributed Routing) is proposed as an efficient logic-based mechanism that adapts to any irregular topology derived from 2D meshes, being an alter…
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
2016
International audience; In the single truck and trailer routing problem with satellite depots (STTRPSD), a truck with a detachable trailer based at a main depot must serve the demand of a set of customers accessible only by truck. Therefore, before serving the customers, it is necessary to detach the trailer in an appropriate parking place (called either a satellite depot or a trailer point) and transfer goods between the truck and the trailer. This problem has applications in milk collection for farms that cannot be reached using large vehicles. In this work we present an integer programming formulation of the STTRPSD. This formulation is tightened with several families of valid inequaliti…
A multi-objective genetic algorithm for the passenger maritime transportation problem
2014
Over the last years, the transportation demand has continuously increased and a further growth is predicted for the next future especially as regards the maritime sector. As a consequence, shipping companies will be asked to improve the supplied services in order to assure a high quality and time-effective goods and passengers transportation, deriving at the same time their own benefits by minimizing costs. Therefore, the optimization of routes and schedules together with the fleet deployment take a meaningful role on companies profitability and efficiency. In such a perspective, the present paper proposes a multi-objective mathematical programming model to determine a set of routes and sch…
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
2007
We present an adaptation of the active-guided evolution strategies metaheuristic for the capacitated vehicle routing problem. The capacitated vehicle routing problem is a classical problem in operations research in which a set of minimum total cost routes must be determined for a fleet of identical capacitated vehicles in order to service a number of demand or supply points. The applied metaheuristic combines the strengths of the well-known guided local search and evolution strategies metaheuristics into an iterative two-stage procedure. The computational experiments were carried out on a set of 76 benchmark problems. The results demonstrate that the suggested method is highly competitive, …
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm
2017
[EN] The Hierarchical Mixed Rural Postman Problem is defined on a mixed graph where arcs and edges that require a service are divided into clusters' that have to be serviced in a hierarchical order. The problem generalizes the Mixed Rural Postman Problem and thus is NP-hard. In this paper, we provide a polyhedral analysis of the problem and propose a branch-and-cut algorithm for its solution based on the introduced classes of valid inequalities. Extensive computational experiments are reported on benchmark instances. The exact approach allows to find the optimal solutions in less than 1 hour for instances with up to 999 vertices, 2678 links, and five clusters.
A Network Protocol to Enhance Robustness in Tree-Based WSNs Using Data Aggregation
2007
This paper proposes a data gathering strategy for wireless sensor networks and an implementation based on the IEEE 802.15.4 standard. The algorithm combines the benefits of single-path and multi-path routing strategies in a hybrid solution which makes use of alternative paths when necessary. We adopt a caching and retransmission technique, which exploits some peculiar features of data aggregation, with the use of implicit acknowledgments of reception. The paper also discusses simulation results that show how the mentioned techniques, combined with exploitation of the features of the IEEE 802.15.4 standard have been used to obtain an efficient protocol that takes energy consumption into acco…